On the Logical Complexity of Autosegmental Representations
نویسنده
چکیده
Autosegmental mapping from disjoint strings of tones and tone-bearing units, a commonly used mechanism in phonological analyses of tone patterns, is shown to not be definable in monadic second-order logic. This is abnormally complex in comparison to other phonological mappings, which have been shown to be monadic second-order definable. In contrast, generation of autosegmental structures from strings is demonstrated to be first-order definable.
منابع مشابه
One-Level Phonology: Autosegmental Representations and Rules as Finite Automata
When phonological rules are regarded as declarative descriptions, it is possible to construct a model of phonology in which rules and representations are no longer distinguished and such procedural devices as rule-ordering are absent. In this paper we present a finite-state model of phonology in which automata are the descriptions and tapes (or strings) are the objects being described. This pro...
متن کاملHow Autosegmental is Phonology?
In this paper I address the following questions: How appropriate/effective are traditional autosegmental representations? What insights do autosegmental representations help us express? Where do autosegmental representations fall short? And finally, what does this all mean for phonology? Such questions are particularly timely, as numerous scholars have abandoned both earlier assumptions of clas...
متن کاملOn Finite-State Tonology with Autosegmental Representations
Building finite-state transducers from written autosegmental grammars of tonal languages involves compiling the rules into a notation provided by the finitestate tools. This work tests a simple, human readable approach to compile and debug autosegmental rules using a simple string encoding for autosegmental representations. The proposal is based on brackets that mark the edges of the tone autos...
متن کاملA Concatenation Operation to Derive Autosegmental Graphs
Autosegmental phonology represents words with graph structures. This paper introduces a way of reasoning about autosegmental graphs as strings of concatenated graph primitives. The main result shows that the sets of autosegmental graphs so generated obey two important, putatively universal, constraints in phonological theory provided that the graph primitives also obey these constraints. These ...
متن کاملAre Feature Hierarchies Autosegmental Hierarchies?*
Phonological representations are blamed for too much. They are taken to task for missing generalizations which can be captured elsewhere. In this paper I review some recent criticisms of the view that feature hierarchies are hierarchies of autosegmental tiers, especially the arguments of Hayes (1990) and Halle (1993), and try to show that although the considerations they raise are important one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017